An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices
نویسندگان
چکیده
We present an iterative method based on the Hermitian and skew-Hermitian splitting for solving the continuous Sylvester equation. By using the Hermitian and skew-Hermitian splitting of the coefficient matrices A and B, we establish a method which is practically inner/outer iterations, by employing a CGNR-like method as inner iteration to approximate each outer iterate, while each outer iteration is induced by a convergent splitting of the coefficient matrices. Via this method, a Sylvester equation with coefficient matrices SA and SB (which are the skew-Hermitian part of A and B, respectively) is solved iteratively by a CGNR-like method. Convergence conditions of this method are studied and numerical examples show the efficiency of this method. In addition, we show that the quasi-Hermitian splitting can induce accurate, robust and effective preconditioned Krylov subspace methods.
منابع مشابه
Global conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملNested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
We present a nested splitting conjugate gradient iteration method for solving large sparse continuous Sylvester equation, in which both coefficient matrices are (non-Hermitian) positive semi-definite, and at least one of them is positive definite. This method is actually inner/outer iterations, which employs the Sylvester conjugate gradient method as inner iteration to approximate each outer it...
متن کاملOn Pmhss Iteration Methods for Continuous Sylvester Equations
The modified Hermitian and skew-Hermitian splitting (MHSS) iteration method and preconditioned MHSS (PMHSS) iteration method were introduced respectively. In the paper, on the basis of the MHSS iteration method, we present a PMHSS iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and complex symmetric positive definite/semi-definite matrices. Under suit...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملGauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations
In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 94 شماره
صفحات -
تاریخ انتشار 2017